List Scheduling: Alone, with Foresight, and with Lookahead
نویسنده
چکیده
List scheduling is a popular method of scheduling. It has the benefits of being a relatively fast technique and producing good results. It has weaknesses when dealing with restricted timing. Two ancillary methods, foresight and lookahead, have been developed to help mitigate this weakness. This paper compares the effectiveness of list scheduling alone, with foresight, and with lookahead. It also shows the benefits of lookahead are accrued with no time overhead.
منابع مشابه
On the Implications of Lookahead Search in Game Playing
Lookahead search is perhaps the most natural and widely used game playing strategy. Given the practical importance of the method, the aim of this paper is to provide a theoretical performance examination of lookahead search in a wide variety of applications. To determine a strategy play using lookahead search, each agent predicts multiple levels of possible re-actions to her move (via the use o...
متن کاملList Based Task Scheduling Algorithms on Heterogeneous Systems - An overview
Task scheduling is key issue in obtaining high performance in heterogeneous systems. Task scheduling in heterogeneous systems is a NP-problem, therefore several heuristic approaches were proposed to solve it. These heuristics are categorized into several classes, such as list based, clustering and task duplication scheduling. Here I consider the list scheduling approach. In this paper, I will h...
متن کاملA Theoretical Examination of Practical Game Playing: Lookahead Search
Lookahead search is perhaps the most natural and widely used game playing strategy. Given the practical importance of the method, the aim of this paper is to provide a theoretical performance examination of lookahead search in a wide variety of applications. To determine a strategy play using lookahead search, each agent predicts multiple levels of possible re-actions to her move (via the use o...
متن کاملQuality vs. Performance in Lookahead Scheduling
We consider the use of lookahead to minimize the average wait time when scheduling jobs on a single machine. We compare the relationship between quantity of lookahead and quality of schedule. Our results indicate that while we do gain further improvement with more lookahead, the amount of improvement drastically decreases beyond Lookahead-1. Further, the time required for each scheduling decisi...
متن کاملOnline Scheduling with Lookahead: Multipass Assembly Lines
This paper describes our use of competitive analysis and the on-line model of computation in a product development setting; speciically, we use competitive analysis to evaluate on-line scheduling strategies for controlling a new generation of networked reprographic machines (combination printer-copier-fax machines servicing a network) currently being developed by companies such as Xerox Corpora...
متن کامل